The Maximum Likelihood Degree of Sparse Polynomial Systems
نویسندگان
چکیده
We consider statistical models arising from the common set of solutions to a sparse polynomial system with general coefficients. The maximum likelihood (ML) degree counts number critical points function restricted model. prove that ML generic is determined by its Newton polytopes and equals mixed volume related Lagrange equations.
منابع مشابه
The Maximum Likelihood Degree
Maximum likelihood estimation in statistics leads to the problem of maximizing a product of powers of polynomials. We study the algebraic degree of the critical equations of this optimization problem. This degree is related to the number of bounded regions in the corresponding arrangement of hypersurfaces, and to the Euler characteristic of the complexified complement. Under suitable hypotheses...
متن کاملMaximum Likelihood Estimation and Polynomial System Solving
This article presents an alternative method to find the global maximum likelihood estimates of the mixing probabilities of a mixture of multinomial distributions. For these mixture models it is shown that the maximum likelihood estimates of the mixing probabilities correspond with the roots of a multivariate polynomial system. A new algorithm, set in a linear algebra framework, is presented whi...
متن کاملVarieties with maximum likelihood degree one
We show that algebraic varieties with maximum likelihood degree one are exactly the images of reduced A-discriminantal varieties under monomial maps with finite fibers. The maximum likelihood estimator corresponding to such a variety is Kapranov’s Horn uniformization. This extends Kapranov’s characterization of A-discriminantal hypersurfaces to varieties of arbitrary codimension.
متن کاملModel Selection Through Sparse Maximum Likelihood Estimation
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to solve a maximum likelihood problem with an added l1-norm penalty term. The problem as formulated is convex but the memory requirements and complexity of existing interior point methods are prohibitive for problems wit...
متن کاملRandom Sparse Polynomial Systems
Abstract Let f :=(f1, . . . , fn) be a sparse random polynomial system. This means that each f i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express the expected number of roots of f inside a region U as the integral over U of a certain mixed volume form. When U = (C∗)n, the classical mixed vol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Applied Algebra and Geometry
سال: 2023
ISSN: ['2470-6566']
DOI: https://doi.org/10.1137/21m1422550